Solving a multicommodity location-allocation problem with non linear costs
نویسندگان
چکیده
This paper deals with a planning problem arising in large logistics companies. The problem consists in defining the optimal number of depots, their location, and their size as well as the routing decisions. Economies of scale are present both in the transportation and in the depots operations. The paper proposes an exact algorithm and an efficient heuristic based on the integration of tabu search and variable neighborhood search principles. Computational results obtained with real-life data and randomly generated but realistic instances prove the validity of the approaches.
منابع مشابه
Solving a location-allocation problem by a fuzzy self-adaptive NSGA-II
This paper proposes a modified non-dominated sorting genetic algorithm (NSGA-II) for a bi-objective location-allocation model. The purpose is to define the best places and capacity of the distribution centers as well as to allocate consumers, in such a way that uncertain consumers demands are satisfied. The objectives of the mixed-integer non-linear programming (MINLP) model are to (1) minimize...
متن کاملA Clustering Based Location-allocation Problem Considering Transportation Costs and Statistical Properties (RESEARCH NOTE)
Cluster analysis is a useful technique in multivariate statistical analysis. Different types of hierarchical cluster analysis and K-means have been used for data analysis in previous studies. However, the K-means algorithm can be improved using some metaheuristics algorithms. In this study, we propose simulated annealing based algorithm for K-means in the clustering analysis which we refer it a...
متن کاملApproximation Methods for Solving the Equitable Location Problem with Probabilistic Customer Behavior
Location-allocation of facilities in service systems is an essential factor of their performance. One of the considerable situations which less addressed in the relevant literature is to balance service among customers in addition to minimize location-allocation costs. This is an important issue, especially in the public sector. Reviewing the recent researches in this field shows that most of t...
متن کاملDesigning Incomplete Hub Location-routing Network in Urban Transportation Problem
In this paper, a comprehensive model for hub location-routing problem is proposed which no network structure other than connectivity is imposed on backbone (i.e. network between hub nodes) and tributary networks (i.e. networks which connect non-hub nodes to hub nodes). This model is applied in public transportation, telecommunication and banking networks. In this model locating and routing is c...
متن کاملGenetic Algorithm-Based Optimization Approach for an Uncapacitated Single Allocation P-hub Center Problem with more realistic cost structure
A p-hub center network design problem is definition of some nodes as hubs and allocation of non-hub nodes to them wherein the maximum travel times between any pair of nodes is minimized. The distinctive feature of this study is proposing a new mathematical formulation for modeling costs in a p-hub center problem. Here, instead of considering costs as a linear function of distance, for the first...
متن کامل